Pursuit - Evasion Games in Mobile Networks
نویسندگان
چکیده
In the last two decades, there has been an enormous effort to deploy a network of autonomous mobile platforms in various scenarios related to military as well as civilian applications. Interesting research problems related to security range from the development of secure communication protocols for a network of autonomous mobile agents to the development of novel deployment algorithms for a group of mobile agents trying to secure a network or an area from malicious intruders. In this thesis, we investigate the interaction between the mobile agents and an intruder in the environment or the communication network. In contradistinction to the previous research in this area, we model the intrusion as a pursuit-evasion game in continuous time and space. We model the intruder as an antagonistic agent and apply tools from differential game theory in order to obtain the optimal motion strategies for the agents to track the intruder as well as evade intrusion.
منابع مشابه
Roadmap Based Pursuit-Evasion and Collision Avoidance
We study pursuit-evasion games for mobile robots and their applications to collision avoidance. In the first part of the paper, under the assumption that the pursuer and the evader (possibly subject to physical constraints) share the same roadmap to plan their strategies, we present sound and complete strategies for three different games. In the second part, we utilize the pursuit-evasion resul...
متن کاملAdaptive Learning Approach of Fuzzy Logic Controller with Evolution for Pursuit-Evasion Games
This paper studies a simplified pursuit-evasion problem. We assume that the evader moves with constant speed along a trajectory that is well-defined and known a priori. The objective of steering control of the pursuer modeled as a nonholonomic unicycle-type mobile robot is to intercept the moving evader. An adaptive learning approach of fuzzy logic controller is developed as an inverse kinemati...
متن کاملSearch problems on 1-skeletons of regular polyhedrons
For pursuit-evasion games played on 1-skeletons of regular polyhedrons some problems of finding the minimum number of pursuers needed for the capture (in various senses) of the mobile invisible evader are considered. The results obtained for these graphs are consequences of fundamental theorems in the theory of graph searching developed by authors in [1, 2, 3].
متن کاملTeam-It: location-based mobile games for multi-agent coordination and negotiation (demonstration)
The multi-agent systems community has made great strides investigating issues such as coordination and negotiation. When addressing human or human-agent behavior, very few approaches have addressed a feature that people are embodied in the real-world and act in geospatial environments. In the past, it has been difficult to perform experiments and collect data for such domains. However, with the...
متن کاملNeural Network Guidance Based on Pursuit-evasion Games with Enhanced Performance
This paper deals with a neural network guidance law based on pursuit-evasion games, and performance enhancing methods for the neural network guidance. Twodimensional pursuit-evasion games solved by using the gradient method are considered. The neural network guidance law in this work employs the range, range rate, line-of-sight rate, and heading error as its input variables. An additional netwo...
متن کامل